Corrigendum: Local Minima in Cross-Validation Functions
نویسندگان
چکیده
منابع مشابه
Convex Kernel Underestimation of Functions with Multiple Local Minima
A function on R with multiple local minima is approximated from below, via linear programming, by a linear combination of convex kernel functions using sample points from the given function. The resulting convex kernel underestimator is then minimized, using either a linear equation solver for a linear-quadratic kernel or by a Newton method for a Gaussian kernel, to obtain an approximation to a...
متن کاملCustomer Validation in Cross-Dock
Considering the importance of validation of customers in the cross-dock and since this is one of the problems of implementing cross-dock system in Iran, this study attempted to extract customer validation criteria. The purpose of the research is to eliminate the distrust of distributors in receiving the funds of the sent items and the statistical sample of this research is the experts of the sy...
متن کاملLocal Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low dimensional embedding that preserves the structure of high-dimensional data points. This paper proposes Local Minima Embedding (LME), a technique to find a lowdimensional embedding that preserves the local minima stru...
متن کاملContinuity of Minima: Local Results
This paper compares and generalizes Berge’s maximum theorem for noncompact image sets established in Feinberg, Kasyanov and Voorneveld [5] and the local maximum theorem established in Bonnans and Shapiro [3, Proposition 4.4].
متن کاملAdiabatic optimization without local minima
Several previous works have investigated the circumstances under which quantum adiabatic optimization algorithms can tunnel out of local energy minima that trap simulated annealing or other classical local search algorithms. Here we investigate the even more basic question of whether adiabatic optimization algorithms always succeed in polynomial time for trivial optimization problems in which t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Royal Statistical Society: Series B (Methodological)
سال: 1992
ISSN: 0035-9246
DOI: 10.1111/j.2517-6161.1992.tb01464.x